Entity Resolution with Empirically Motivated Priors
نویسندگان
چکیده
منابع مشابه
Entity Resolution with Empirically Motivated Priors
Databases often contain corrupted, degraded, and noisy data with duplicate entries across and within each database. Such problems arise in citations, medical databases, genetics, human rights databases, and a variety of other applied settings. The target of statistical inference can be viewed as an unsupervised problem of determining the edges of a bipartite graph that links the observed record...
متن کاملAn Empirically Motivated Reinterpretation of Dependency Grammar
Dependency grammar is usually interpreted as equivalent to a strict form of X–bar theory that forbids the stacking of nodes of the same bar level (e.g., N immediately dominating N with the same head). But adequate accounts of one–anaphora and of the semantics of multiple modifiers require such stacking and accordingly argue against dependency grammar. Dependency grammar can be salvaged by reint...
متن کاملVideo Super-resolution with Scene-specific Priors
In this paper, we propose a method to improve the spatial resolution of video sequences. Our approach is inspired by previous image hallucination work [12]. There are two main contributions of the proposed method. First, the information from cameras with different spatial-temporal resolutions is combined in our framework. This is achieved by constructing training dictionary using the high resol...
متن کاملEntity Resolution with Evolving Rules
Entity resolution (ER) identifies database records that refer to the same real world entity. In practice, ER is not a one-time process, but is constantly improved as the data, schema and application are better understood. We address the problem of keeping the ER result up-to-date when the ER logic “evolves” frequently. A naı̈ve approach that re-runs ER from scratch may not be tolerable for resol...
متن کاملEfficient Entity Resolution with MFIBlocks
Entity resolution is the process of discovering groups of tuples that correspond to the same real world entity. In order to avoid the prohibitively expensive comparison of all pairs of tuples, blocking algorithms separate the tuples into blocks which are highly likely to contain matching pairs. Tuning is a major challenge in the blocking process. In particular, contemporary blocking algorithms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bayesian Analysis
سال: 2015
ISSN: 1936-0975
DOI: 10.1214/15-ba965si